A characterization of pseudoinvexity in multiobjective programming
نویسندگان
چکیده
In this paper, we introduce new classes of vector functions which generalize the class of scalar invex functions. We prove that these new classes of vector functions are characterized in such a way that every vector critical point is an efficient solution of a Multiobjective Programming Problem. We establish relationships between these new classes of functions and others used in the study of efficient andweakly efficient solutions. © 2008 Elsevier Ltd. All rights reserved.
منابع مشابه
Weak efficiency in multiobjective variational problems under generalized convexity
In this paper, we provide new pseudoinvexity conditions on the involved functionals of amultiobjective variational problem, such that all vector Kuhn-Tucker or Fritz John points are weakly efficient solutions if and only if these conditions are fulfilled. We relate weakly efficient solutions to optimal solutions of weighting problems. We improve recent papers, and we generalize pseudoinvexity c...
متن کاملResearch Article Continuous-Time Multiobjective Optimization Problems via Invexity
We introduce some concepts of generalized invexity for the continuous-time multiobjective programming problems, namely, the concepts of Karush-Kuhn-Tucker invexity and Karush-Kuhn-Tucker pseudoinvexity. Using the concept of Karush-Kuhn-Tucker invexity, we study the relationship of the multiobjective problems with some related scalar problems. Further, we show that Karush-Kuhn-Tucker pseudoinvex...
متن کاملDuality for Multiobjective Variational Control and Multiobjective Fractional Variational Control Problems with Pseudoinvexity
The relationship between mathematical programming and classical calculus of variation was explored and extended by Hanson [6]. Thereafter variational programming problems have attracted some attention in literature. Duality for multiobjective variational problems has been of much interest in the recent years, and several contributions have been made to its development (see, e.g., Bector and Hus...
متن کاملCharacterization of Properly Efficient Solutions for Convex Multiobjective Programming with Nondifferentiable vanishing constraints
This paper studies the convex multiobjective optimization problem with vanishing constraints. We introduce a new constraint qualification for these problems, and then a necessary optimality condition for properly efficient solutions is presented. Finally by imposing some assumptions, we show that our necessary condition is also sufficient for proper efficiency. Our results are formula...
متن کاملOptimality Conditions and Second-Order Duality for Nondifferentiable Multiobjective Continuous Programming Problems
Fritz John and Karush-Kuhn-Tucker type optimality conditions for a nondifferentiable multiobjective variational problem are derived. As an application of Karush-Kuhn-Tucker type optimality conditions, Mond-weir type second-order nondifferentiable multiobjective dual variational problems is constructed. Various duality results for the pair of Mond-Weir type second-order dual variational problems...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Mathematical and Computer Modelling
دوره 48 شماره
صفحات -
تاریخ انتشار 2008